A Symbolic-Connectionist Model of Relation Discovery

نویسندگان

  • Leonidas A. A. Doumas
  • John E. Hummel
چکیده

Relational reasoning is central in human cognition. Numerous computational models address the component processes of relational reasoning, however these models require the modeler to hand-code the vocabulary of relations on which the model operates. The acquisition of relational concepts remains poorly understood. We present a theory of relation discovery instantiated in a symbolic-connectionist model, which learns structured representations of attributes and relations from unstructured distributed representations of objects by a process of comparison, and subsequently refines these representations through a process of mapping-based schema induction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallelization of Connectionist Models Based on a Symbolic Formalism

In this paper we study the parallelization of the inference process for connectionist models. We use a symbolic formalism for the representation of the connectionist models. With this translation, the training mechanism is local in the elements of the network, the computing power is improved in the network nodes and a local hybridization with symbolic parts is achieved. The inference in the nal...

متن کامل

Computational modeling of dynamic decision making using connectionist networks

In this research connectionist modeling of decision making has been presented. Important areas for decision making in the brain are thalamus, prefrontal cortex and Amygdala. Connectionist modeling with 3 parts representative for these 3 areas is made based the result of Iowa Gambling Task. In many researches Iowa Gambling Task is used to study emotional decision making. In these kind of decisio...

متن کامل

Symbolic models of human sentence processing

We take “symbolic models of sentence processing” to mean approaches in which processing is characterized in terms of relatively discrete, combinatorial representations. We survey the distinct approaches: Grammar-based, automataand informationtheoretic, those involving complexity metrics and principles, cognitive architecturebased, and probabilistic models. An example is provided of each approac...

متن کامل

Dynamical Insight into Structure 1 Running head: DYNAMICAL INSIGHT INTO STRUCTURE IN CONNECTIONIST MODELS Dynamical Insight into Structure in Connectionist Models

I discuss a connectionist model, based on Elman’s (1990, 1991) Simple Recurrent Network, of the acquisition of complex syntactic structure. While not intended as a detailed model of the process children go through in acquiring natural languages, the model helps clarify concepts that may be useful for understanding the development of complex abilities. It provides evidence that connectionist lea...

متن کامل

A Hybrid and Connectionist Architecture for a Scanning Understanding

This paper describes a general architecture SCAN for hybrid symbolic connectionist processing of natural language phrases. SCAN's architecture shows how learned connectionist domain-dependent semantic representations can be combined with encoded symbolic syntactic representations. Within this general architecture we focus on a connectionist model for semantic classiication based on a scanning u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005